COINCIDENCE THEOREMS AND MATCHING THEOREMS

Some Matching Theorems

A graph G is said to be even if its vertices can be put into two distinct classes A and B so that no two vertices of the same class are joined by an edge. If in addition each class contains exactly n representatives, G is said to be of type (n, n) . In what follows all our graphs will be of this form . Let every vertex in A be joined to every vertex in B . Then we say that G is saturated. A mat...

Matching Theorems for Combinatorial

Coincidence Theorems on Product FC-spaces

In 1937, Von Neumann [1] established the famous coincidence theorem. Since then, the coincidence theorem was generalized in many directions. Browder [2] first proved some basic coincidence theorems for a pair of set-valued mappings in compact setting of topological vector spaces and gave some applications to minimax inequalities and variational inequalities. Recently, Ding [3] established some ...

Admissible maps , intersection results , coincidence theorems

We obtain generalizations of the Fan’s matching theorem for an open (or closed) covering related to an admissible map. Each of these is restated as a KKM theorem. Finally, applications concerning coincidence theorems and section results are given.

Some General Random Coincidence Point Theorems

We prove some general random coincidence point theorems. Our results unify and extend several known, as well as some new, random coincidence point and random fixed point theorems.